منابع مشابه
ROP is Still Dangerous: Breaking Modern Defenses
Return Oriented Programming (ROP) has become the exploitation technique of choice for modern memory-safety vulnerability attacks. Recently, there have been multiple attempts at defenses to prevent ROP attacks. In this paper, we introduce three new attack methods that break many existing ROP defenses. Then we show how to break kBouncer and ROPecker, two recent low-overhead defenses that can be a...
متن کاملApplicability of Transactional Memory to Modern Codes
In this paper we illustrate the features and study the applicability of transactional memory (TM) as an efficient and easy-to-use alternative for handling memory conflicts in multi-theaded physics simulations that use shared memory. The tool used for our preliminary analysis of this novel construct is IBM’s freely available Software Transactional Memory (STM) system. Instead of attempting to ap...
متن کاملDevelopment Strategies for Modern Predictive Simulation Codes
c © 2007 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
متن کاملPermutation codes invariant under isometries
The symmetric group Sn on n letters is a metric space with respect to the Hamming distance. The corresponding isometry group is well known to be isomorphic to the wreath product Sn oS2. A subset of Sn is called a permutation code or a permutation array, and the largest possible size of a permutation code with minimum Hamming distance d is denoted by M(n, d). Using exhaustive search by computer ...
متن کاملA3-Codes under Collusion Attacks
An A-code is an extension of A-code in which none of the three participants, transmitter, receiver and arbiter, is assumed trusted. In this paper we extend the previous model of A-codes by allowing transmitter and receiver not only to individually attack the system but also collude with the arbiter against the other. We derive informationtheoretic lower bounds on success probability of various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Law Review
سال: 1920
ISSN: 0026-2234
DOI: 10.2307/1277953